The unlabelled speed of a hereditary graph property
نویسندگان
چکیده
منابع مشابه
A Note on the Speed of Hereditary Graph Properties
For a graph property X, let Xn be the number of graphs with vertex set {1, . . . , n} having property X, also known as the speed of X. A property X is called factorial if X is hereditary (i.e. closed under taking induced subgraphs) and n1 ≤ Xn ≤ n c2n for some positive constants c1 and c2. Hereditary properties with the speed slower than factorial are surprisingly well structured. The situation...
متن کاملWhat is the furthest graph from a hereditary property?
For a graph property P, the edit distance of a graph G from P, denoted EP(G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in order to turn it into a graph satisfying P. What is the furthest graph on n vertices from P and what is the largest possible edit distance from P? Denote this maximal distance by ed(n,P). This question is motivated by algor...
متن کاملA Fast Method for Property Prediction in Graph-Structured Data from Positive and Unlabelled Examples
The analysis of large and complex networks, or graphs, is becoming increasingly important in many scientific areas including machine learning, social network analysis and bioinformatics. One natural type of question that can be asked in network analysis is “Given two sets R and T of individuals in a graph with complete and missing knowledge, respectively, about a property of interest, which ind...
متن کاملAsymptotic study of families of unlabelled trees and other unlabelled graph structures
This thesis deals with the asymptotic analysis of diverse random graph structures, especially random trees. For this purpose, we consider the set of objects of fixed size n (where the size is mostly describing the number of vertices of a graph), and choose an object from it uniformly at random. We discuss properties of such a random representative, as the size n tends to infinity. All results a...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2009
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2008.03.004